On Grr Obner Bases in Monoid and Group Rings
نویسندگان
چکیده
Following Buchberger's approach to computing a Grr obner basis of a polynomial ideal in polynomial rings, a completion procedure for nitely generated right ideals in ZH] is given, where H is an ordered monoid presented by a nite, convergent semi{Thue system ((; T). Taking a nite set F ZH] we get a (possibly innnite) basis of the right ideal generated by F , such that using this basis we have unique normal forms for all p 2 ZH] (especially the normal form is 0 in case p is an element of the right ideal generated by F). As the ordering and multiplication on H need not be compatible, reduction has to be deened carefully in order to make it Noetherian. Further we no longer have p x ! p 0 for p 2 ZH];x 2 H. Similar to Buchberger's s{polynomials, connuence criteria are developed and a completion procedure is given. In case T = ; or ((; T) is a convergent, 2{monadic presentation of a group providing inverses of length 1 for the generators or ((; T) is a convergent presentation of a commutative monoid , termination can be shown. So in this cases nitely generated right ideals admit nite Grr obner bases. The connection to the subgroup problem is discussed.
منابع مشابه
String Rewriting and Grr Obner Bases { a General Approach to Monoid and Group Rings Presented at the Workshop on Symbolic Rewriting Systems
The concept of algebraic simpliication is of great importance for the eld of symbolic computation in computer algebra. In this paper we review some fundamental concepts concerning reduction rings in the spirit of Buchberger. The most important properties of reduction rings are presented. The techniques for presenting monoids or groups by string rewriting systems are used to deene several types ...
متن کاملA Note on Nielsen Reduction and CosetEnumerationBirgit Reinert
Groups can be studied using methods from diierent elds such as combina-torial group theory or string rewriting. Recently techniques from Grr obner basis theory for free monoid rings (non-commutative polynomial rings) respectively free group rings have been added to the set of methods due to the fact that monoid and group presentations (in terms of string rewriting systems) can be linked to spec...
متن کاملComputing Grr Obner Bases by Fglm Techniques in a Noncommutative Setting
A generalization of the FGLM technique is given to compute Grr obner bases for two-sided ideals of free nitely generated algebras. Specializations of this algorithm are presented for the cases in which the ideal is determined by either functionals or monoid (group) presentations. Generalizations are discussed in order to compute G-bases on (twisted) semigroup rings. It is well known that the co...
متن کاملGrr Obner Bases for Polynomial Ideals over Commutative Noetherian Rings and Related Results ?
We present a completion-like procedure for constructing weak and strong Grr obner bases for polynomial ideals over commutative Noetherian rings with unit. This generalizes all the known algorithms for computing Grr obner bases for polynomial ideals over various diierent coeecient domains. The coeecient domain is incorporated using constraints. Constraints allow us to describe an optimized proce...
متن کاملOn Grr Obner Bases for Two-sided Ideals in Nilpotent Group Rings
An algorithm for constructing Grr obner bases for right and for two-sided ideals in nilpotent group rings is presented.
متن کامل